Site percolation thresholds and universal formulas for the Archimedean lattices
نویسندگان
چکیده
The site percolation thresholds pc are determined to high precision for eight Archimedean lattices, by the hull-walk gradient-percolation simulation technique, with the results pc = 0.697 043, honeycomb or (6 ), 0.807 904 (3, 12), 0.747 806 (4, 6, 12), 0.729 724 (4, 8), 0.579 498 (3, 6), 0.621 819 (3, 4, 6, 4), 0.550 213 (3, 4), and 0.550 806 (3, 4, 3, 4), and errors of about ±2 × 10. (The remaining Archimedean lattices are the square (4), triangular (3) and Kagomé (3, 6, 3, 6), for which pc is already known exactly or to a high degree of accuracy.) The numerical result for the (3, 12) lattice is consistent with the exact value [1 − 2 sin(π/18)]1/2, which we also derive. The values of pc for all Archimedean lattices are found to be linearly related to the density of sites within an error of about 1%, which predicts pc more accurately than correlations based just upon the coordination number can give. Comparison with anisotropic lattices is also made. PACS numbers(s): 64.60Ak, 05.70.Jk Typeset using REVTEX 1
منابع مشابه
Desirable Properties of Universal Formulas for Percolation Thresholds
Percolation models are infinite random graph models which exhibit phase transition behavior at critical values called percolation thresholds. Several so-called ”universal formulas” that predict approximate values for percolation thresholds of all periodic graphs have been proposed in the physics and engineering literature. The existing universal formulas have been found to have substantial erro...
متن کاملEstimation of Bond Percolation Thresholds on the Archimedean Lattices
We give accurate estimates for the bond percolation critical probabilities on seven Archimedean lattices, for which the critical probabilities are unknown, using an algorithm of Newman and Ziff.
متن کاملReply to the comment “ Universal Formulae for Percolation Thresholds ”
In a recent paper, we have reported a universal power law for both site and bond percolation thresholds for any lattice of cubic symmetry. Extension to anisotropic lattices is discussed. ∗Laboratoire associé au CNRS (URA n◦ 800) et à l’Université P. et M. Curie Paris 6
متن کاملTopology invariance in Percolation Thresholds
An universal invariant for site and bond percolation thresholds ( pcs and pcb respectively) is proposed. The invariant writes {pcs} 1 as {pcb} − 1 a b = δ/d where as, ab and δ are positive constants, and d the space dimension. It is independent of the coordination number, thus exhibiting a topology invariance at any d. The formula is checked against a large class of percolation problems, includ...
متن کاملUniversal condition for critical percolation thresholds of kagomé-like lattices.
Lattices that can be represented in a kagomé-like form are shown to satisfy a universal percolation criticality condition, expressed as a relation between P3 , the probability that all three vertices in the triangle connect, and P0 , the probability that none connect. A linear approximation for P3(P0) is derived and appears to provide a rigorous upper bound for critical thresholds. A numericall...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998